MODELS OF MARTIN-LÖF TYPE THEORY FROM ALGEBRAIC WEAK FACTORISATION SYSTEMS
نویسندگان
چکیده
منابع مشابه
Game Semantics for Martin-Löf Type Theory
We present a new game semantics for Martin-Löf type theory (MLTT); our aim is to give a mathematical and intensional explanation of MLTT. Specifically, we propose a category with families (a categorical model of MLTT) of a novel variant of games, which induces an injective (when Id-types are excluded) and surjective interpretation of the intensional variant of MLTT equipped with unit-, empty-, ...
متن کاملNotions of Anonymous Existence in Martin-Löf Type Theory
As the groupoid model of Hofmann and Streicher proves, identity proofs in intensional Martin-Löf Type Theory can not generally shown to be unique. Inspired by a theorem by Hedberg, we give some simple characterizations of types that do have unique identity proofs. A key ingredient in these constructions are weakly constant endofunctions on identity types. We study such endofunctions on arbitrar...
متن کاملAlgebraic Weak Factorisation Systems I: Accessible Awfs
Algebraic weak factorisation systems (awfs) refine weak factorisation systems by requiring that the assignations sending a map to its first and second factors should underlie an interacting comonad–monad pair on the arrow category. We provide a comprehensive treatment of the basic theory of awfs—drawing on work of previous authors—and complete the theory with two main new results. The first pro...
متن کاملAlgebraic Weak Factorisation Systems Ii: Categories of Weak Maps
We investigate the categories of weak maps associated to an algebraic weak factorisation system (awfs) in the sense of Grandis–Tholen [14]. For any awfs on a category with an initial object, cofibrant replacement forms a comonad, and the category of (left) weak maps associated to the awfs is by definition the Kleisli category of this comonad. We exhibit categories of weak maps as a kind of “hom...
متن کاملWell-Ordering, Proofs for Martin-Löf Type Theory
We present well-ordering proofs for Martin-Löf’s type theory with W-type and one universe. These proofs, together with an embedding of the type theory in a set theoretical system as carried out in [Set93] show that the proof theoretical strength of the type theory is precisely ψΩ1ΩI+ω, which is slightly more than the strength of Feferman’s theory T0, classical set theory KPI and the subsystem o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2021
ISSN: 0022-4812,1943-5886
DOI: 10.1017/jsl.2021.39